Fast monotone summation over disjoint sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Monotone Summation over Disjoint Sets

We study the problem of computing an ensemble of multiple sums where the summands in each sum are indexed by subsets of size p of an n-element ground set. More precisely, the task is to compute, for each subset of size q of the ground set, the sum over the values of all subsets of size p that are disjoint from the subset of size q. We present an arithmetic circuit that, without subtraction, sol...

متن کامل

Relatively monotone variational inequalities over product sets

New concepts of monotonicity which extend the usual ones are introduced for variational inequality problems over product sets. They enable us to strengthen existence results and extend the eld of applications of the solution methods. c © 2001 Elsevier Science B.V. All rights reserved.

متن کامل

Positive sets and monotone sets

In this paper, we show how convex analysis can be applied to the theory of sets that are “positive” with respect to a continuous quadratic form on a Banach space. Monotone sets can be considered as a special case of positive sets, and we show how our results lead to very efficient proofs of a number of results on monotone sets. One of the key techniques that we use is a generalization of the Fi...

متن کامل

Minimal Sets over Monotone Predicates in Boolean Formulae

The importance and impact of the Boolean satisfiability (SAT) problem in many practical settings is well-known. Besides SAT, a number of computational problems related with Boolean formulas find a wide range of practical applications. Concrete examples for CNF formulas include computing prime implicates (PIs), minimal models (MMs), minimal unsatisfiable subsets (MUSes), minimal equivalent subse...

متن کامل

Twofold fast summation

Debugging accumulation of floating-point errors is hard; ideally, computer should track it automatically. Here we consider twofold approximation of exact real with value + error pair of floating-point numbers. Normally, value + error sum is more accurate than value alone, so error can estimate deviation between value and its exact target. Fast summation algorithm, that provides twofold sum of ∑...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2014

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2013.12.003